Cryptographic properties of Groth sequences

نویسندگان

  • Ed Dawson
  • John A. Asenstorfer
  • P. Gray
چکیده

In stream cipher the terms of an infinite binary seOluel1ce are added modulo two to binary plaintext to form One method Groth for this is to sum second products of the stages of maximal length sequence the products are defined by a Langford It was claimed that could be produced in this fashion with maximum provided are used. In this paper these sequences are by using recent results on stream

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Cryptographic Primitives for Non-Interactive Zero-Knowledge Proofs and Applications

Non-interactive zero-knowledge (NIZK) proofs have enjoyed much interest in cryptography since they were introduced more than twenty years ago by Blum et al. [BFM88]. While quite useful when designing modular cryptographic schemes, until recently NIZK could be realized efficiently only using certain heuristics. However, such heuristic schemes have been widely criticized. In this work we focus on...

متن کامل

Automorphic Signatures in Bilinear Groups

We introduce the notion of automorphic signatures, which satisfy the following properties: the verification keys lie in the message space, messages and signatures consist of group elements only, and verification is done by evaluating a set of pairing-product equations. These signatures make a perfect counterpart to the powerful proof system by Groth and Sahai (Eurocrypt 2008). We provide practi...

متن کامل

Cryptography in Subgroups of Zn

We demonstrate the cryptographic usefulness of a small subgroup of Z∗ n of hidden order. Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of

متن کامل

Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures

We introduce the notion of automorphic signatures, which satisfy the following properties: the verification keys lie in the message space, messages and signatures consist of elements of a bilinear group, and verification is done by evaluating a set of pairing-product equations. These signatures make a perfect counterpart to the powerful proof system by Groth and Sahai (Eurocrypt 2008). We provi...

متن کامل

Achieving Optimal Anonymity in Transferable E-Cash with a Judge

Electronic cash (e-cash) refers to money exchanged electronically. The main features of traditional cash are usually considered desirable also in the context of e-cash. One such property is off-line transferability, meaning the recipient of a coin in a transaction can transfer it in a later payment transaction to a third person without contacting a central authority. Among security properties, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1990